Answering regular path queries in expressive Description Logics via alternating tree-automata
نویسندگان
چکیده
Article history: Received 23 December 2009 Received in revised form 3 April 2013 Available online 18 April 2014
منابع مشابه
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to answer complex queries beyond instance retrieval, taking into account constraints expressed in a knowledge base. We consider this task for positive existential path queries (which generalize conjunctive queries and uni...
متن کاملOn Query Answering in Description Logics with Number Restrictions on Transitive Roles
We study query answering in the description logic SQ supporting number restrictions on both transitive and non-transitive roles. Our main contributions are (i) a tree-like model property for SQ knowledge bases and, building upon this, (ii) an automata based decision procedure for answering two-way regular path queries, which gives a 3ExpTime upper bound.
متن کاملAnswering Expressive Path Queries over Lightweight DL Knowledge Bases
We establish tight complexity bounds for answering an extension of conjunctive 2-way regular path queries over EL and DL-Lite knowledge bases.
متن کاملConjunctive Regular Path Queries in Lightweight Description Logics
Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive queries and have been extensively studied in the database community. Somewhat surprisingly, there has been little work aimed at using such queries in the context of description logic (DL) knowledge bases, and all existing results target expressive DLs, even though lightweight DLs are considered b...
متن کاملQuery Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
The high computational complexity of the expressive Description Logics (DLs) that underlie the OWL standard has motivated the study of their Horn fragments, which are usually tractable in data complexity and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms for answering conjunctive 2-way regular path queries (2CRPQs), a nontrivial ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 237 شماره
صفحات -
تاریخ انتشار 2014